Approximation Algorithms for Item Pricing
نویسندگان
چکیده
We present approximation algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our main result is an O(k)approximation for pricing items to single-minded bidders who each want at most k items. For the case k = 2 (where we get a 4-approximation) this can be viewed as the following graph vertex pricing problem: given a graph G with valuations ve on the edges, find prices pi for the vertices to maximize ∑ {e=(i,j):ve≥pi+pj} pi + pj . We also improve the approximation of [6] from O(log m + log n) toO(log n) for the “highway problem” in which all desired subsets are intervals on a line. Research supported in part by NSF grants CCR-0105488, CCR-0122581, and IIS-0121678.
منابع مشابه
Optimal Iterative Pricing with Positive Network Externalities
In this paper, we study optimal pricing for revenue maximization in the presence of positive network externalities. In our model, the value of a digital good for a buyer is a function of the set of buyers who have already bought the item. In this setting, a buyer’s decision to buy an item depends on the price of the item as well as the set of other buyers that own the item. The revenue maximiza...
متن کاملOptimal Iterative Pricing over Social Networks
We study the optimal pricing for revenue maximization over social networks in the presence of positive network externalities. In our model, the value of a digital good for a buyer is a function of the set of buyers who have already bought the item. In this setting, a decision to buy an item depends on its price and also on the set of other buyers that have already owned that item. The revenue m...
متن کاملOn the hardness of pricing loss-leaders
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, which means each of them has a budget and they will either buy all the items if the total price is within their budget or they will buy none of the items. The goal is to price each item with profit margin p1, p2, ..., pn...
متن کاملPricing Queries Approximately Optimally
Data as a commodity has always been purchased and sold. Recently, web services that are data marketplaces have emerged that match data buyers with data sellers. So far there are no guidelines how to price queries against a database. We consider the recently proposed query-based pricing framework of Koutris et al. [13] and ask the question of computing optimal input prices in this framework by f...
متن کاملItem Pricing for Revenue Maximization in Combinatorial Auctions
In this talk we present item pricing algorithms and mechanisms for revenue maximization in combinatorial auctions. We start by considering the unlimitedsupply combinatorial auction setting and present a simple algorithm [1] which achieves an O(k) approximation for the case of single-minded bidders who each want at most k items, improving on the O(k2) bound of Briest and Krysta [3]. We then show...
متن کامل